Continuation-Passing Style and Strong Normalisation for Intuitionistic Sequent Calculi
نویسندگان
چکیده
The intuitionistic fragment of the call-by-name version of Curien and Herbelin’s λμμ̃-calculus is isolated and proved strongly normalising by means of an embedding into the simply-typed λ-calculus. Our embedding is a continuation-and-garbage-passing style translation, the inspiring idea coming from Ikeda and Nakazawa’s translation of Parigot’s λμ-calculus. The embedding simulates reductions while usual continuation-passing-style transformations erase permutative reduction steps. For our intuitionistic sequent calculus, we even only need “units of garbage” to be passed. We apply the same method to other calculi, namely successive extensions of the simply-typed λ-calculus leading to our intuitionistic system, and already for the simplest extension we consider (λ-calculus with generalised application), this yields the first proof of strong normalisation through a reduction-preserving embedding.
منابع مشابه
Resource control and strong normalisation
We introduce the resource control cube, a system consisting of eight intuitionistic lambda calculi with either implicit or explicit control of resources and with either natural deduction or sequent calculus. The four calculi of the cube that correspond to natural deduction have been proposed by Kesner and Renaud and the four calculi that correspond to sequent lambda calculi are introduced in th...
متن کاملNormalization and continuation-passing-style interpretation of simply-typed call-by-need λ-calculus with control
Ariola et al defined a call-by-need λ-calculus with control, together with a sequent calculus presentation of it. They mechanically derive from the sequent calculus presentation a continuationpassing-style transformation simulating the reduction. In this paper we consider the simply-typed version of the calculus and proove its normalization by means of a realizability interpretation. This justi...
متن کاملExplicit substitutions for the - calculus ?
The-calculus is a-calculus with a control-like operator whose reduction rules are closely related to normalisation procedures in classical logic. We introduce exp, an explicit substitution calculus for , and study its properties. In particular, we show that exp preserves strong normalisation, which provides us with the rst example {moreover a very natural one indeed{ of explicit substitution ca...
متن کاملAustria-Japan Workshop on Symbolic Computation and Software Verification
We show that continuation passing style translations (CPS-translations) can be used to prove strong cut-elimination of sequent cal-culi. One of the simplest methods to prove strong normalizability (SN) of calculi isto give a reduction preserving translation from the system to another for whichSN is already proved. For a very easy example, SN of the Church-style simplytyped λ...
متن کاملStrong Normalisation of Cut-Elimination that Simulates β-Reduction Long version
This paper is concerned with strong normalisation of cutelimination for a standard intuitionistic sequent calculus. The cut-elimination procedure is based on a rewrite system for proof-terms with cut-permutation rules allowing the simulation of β-reduction. Strong normalisation of the typed terms is inferred from that of the simply-typed λ-calculus, using the notions of safe and minimal reducti...
متن کامل